Using Model Checking for Pre-Planning Analysis
نویسندگان
چکیده
Planning domain descriptions contain many structural features, not made explicit by the domain designer but nevertheless present in the representation, that can be exploited by a planner to reduce search. We have explored the effect of a range of logical features, extracted during pre-planning analysis, on the search performance of both forwardand backward-searching planning systems and have confirmed that considerable planning-time benefits can result from the use of efficient pre-planning analysis techniques. Domains involving time and other numeric quantities contain non-logical features which are harder to extract from a domain model. We have explored the combination of our existing pre-planning technology with standard model-checking approaches in order to extract temporal features of a planning domain that can improve planning performance. In this paper we explain how such domain features are extracted and how they can be exploited by the search strategy of a planner.
منابع مشابه
Mixed Propositional and Numeric Planning in the Model Checking Integrated Planning System
The paper considers the extensions to the domainindependent Model Checking Integrated Planning System (MIPS) to pre-processes and solve mixed propositional and numerical planning problems in PDDL+ syntax for the 3rd international planning competition. The static analyzer grounds all predicates and functors, distinguishes constant from fluent atoms and numerical constants from variables. It furt...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملA Dynamic Epistemic Framework for Conformant Planning
In this paper, we introduce a lightweight dynamic epistemic logical framework for automated planning under initial uncertainty. We reduce plan verification and conformant planning to model checking problems of our logic. We show that the model checking problem of the iteration-free fragment is PSPACE-complete. By using two non-standard (but equivalent) semantics, we give novel model checking al...
متن کاملA Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کامل